Approximate String Matching: A Simpler Faster Algorithm
نویسندگان
چکیده
منابع مشابه
A Faster Algorithm for Approximate String Matching
We present a new algorithm for on line approximate string matching The algorithm is based on the simulation of a non deterministic nite automaton built from the pattern and using the text as input This simulation uses bit operations on a RAM machine with word length O log n being n the maximum size of the text The running time achieved is O n for small patterns i e m O p log n independently of ...
متن کاملFaster Bit-Parallel Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The rst one Myers, J. of the ACM, 1999], searches for a pattern of length m in a text of length n permitting k diierences in O(mn=w) time, where w is the width of the computer word. The second one Navarro and Raanot, ACM JEA, 2000], extends a sublinear-time exact algorithm to approximat...
متن کاملFaster Filters for Approximate String Matching
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor filters, and which are among the best practical algorithms for approximate string matching using a text index. Suffix filters are stronger, i.e., produce fewer false matches than factor filters. We demonstrate experiment...
متن کاملA Faster Algorithm for Approximate String MatchingExtended
We present a new algorithm for on-line approximate string matching. The algorithm is based on the simulation of a non-deterministic nite automaton built from the pattern and using the text as input. This simulation uses bit operations on a RAM machine with word length O(log n), being n the maximum size of the text. The running time achieved is O(n) for small patterns (i.e. m = O(p log n)), inde...
متن کاملA Consensus Algorithm for Approximate String Matching
Approximate string matching (ASM) is a well-known computational problem with important applications in database searching, plagiarism detection, spelling correction, and bioinformatics. The two main issues with most ASM algorithms are (1) computational complexity, and (2) low specificity due to a large amount of false positives being reported. In this paper, a very efficient ASM method is propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2002
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539700370527